A Maximum Edge-weight Clique Finding Algorithmic Approach for Solving Protein Side-chain Positioning Problem

نویسندگان

  • Dukka Bahadur
  • Etsuji Tomita
  • Tatsuya Akutsu
چکیده

We have developed a novel approach to solve the protein side-chain packing problem using the notion of a maximum edge-weight clique. Our approach is based on efficient reduction of protein side-chain packing problem to a graph and then solving the reduced graph to find the maximum clique. Since our approach is based on deterministic algorithms in contrast to the various existing algorithms based on heuristic approaches, our algorithm guarantees of finding an optimal solution. We have compared our results with the various existing approaches and have found that our results are comparable or considerably better than the existing methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Protein Side-chain Packing Problem: A Maximum Edge-weight Clique Algorithmic Approach

"Protein Side-chain Packing" has an ever-increasing application in the field of bio-informatics, dating from the early methods of homology modeling to protein design and to the protein docking. However, this problem is computationally known to be NP-hard. In this regard, we have developed a novel approach to solve this problem using the notion of a maximum edge-weight clique. Our approach is ba...

متن کامل

Large Scale Protein Side-Chain Packing Based on Maximum Edge-Weight Clique Finding Algorithms

The protein side-chain packing problem is computationally known to be NP-complete [1]. A number of approaches has been proposed for side-chain packing. As the size of the protein becomes larger, the sampling space increases exponentially. Hence, large scale protein side-chain packing In this regard, we had also presented a maximum edge-weight clique based algorithm for protein side-chain packin...

متن کامل

Solving the maximum edge weight clique problem via unconstrained quadratic programming

The unconstrained quadratic binary program (UQP) is proving to be a successful modeling and solution framework for a variety of combinatorial optimization problems. Experience reported in the literature with several problem classes has demonstrated that this approach works surprisingly well in terms of solution quality and computational times, often rivaling and sometimes surpassing more tradit...

متن کامل

New Ternary and Quaternary Equidistant Constant Weight Codes

We consider the problem of finding bounds on the size of ternary and quaternary equidistant constant weight codes. We present a computer realization of an algorithm for solving the maximum clique problem. We use it for finding the exact values of the maximum size for ternary and quaternary equidistant constant weight codes for all open cases for n ≤ 10 are found.

متن کامل

The Maximum Clique Problem Handbook Of Combinatorial Optimization

The maximum clique problem (MCP) is to determine a sub graph of maximum cardinality. A clique is a The corresponding optimization problem i.e. finding the maximum Maximum Clique Problem. in Handbook of Combinatorial. Common theme of every optimization problem: of semidefinite programming, A module on combinatorial optimization, Selected topics: The largest clique (i.e., complete subgraph)! In “...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004